On the Job-Shop Scheduling Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times

This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some { usual { notations about the general problem. Speciic notations concerning with setup times will be introduced later. The bibliograacal study, in Section 2 focuses on recent papers on both problems. Section 3 presents a general s...

متن کامل

An Algorithm of scheduling for the Job Shop Scheduling Problem

This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the Job Shop Scheduling Problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better effici...

متن کامل

Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1960

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.8.2.219